Optimal seeding in knockout tournaments

نویسندگان

  • Thuc Vu
  • Yoav Shoham
چکیده

Optimal seeding in balanced knockout tournaments has only been studied in very limited settings, for example, maximizing predictive power for up to 8 players using only the relative ranking of the players (ordinal information). We broaden the scope of the analysis along several dimensions: tournaments of size up to 128, different player models, ordinal as well as cardinal solutions, and two additional objective functions.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Broadening the Scope of Optimal Seeding Analysis in Knockout Tournaments

Optimal seeding in balanced knockout tournaments has only been studied in very limited settings, for example, maximizing predictive power for up to 8 players using only the relative ranking of the players (ordinal information). We dramatically broaden the scope of the analysis along several dimensions. First, we propose a heuristic algorithm that makes use of available cardinal information and ...

متن کامل

A theory of knockout tournament seedings

This paper provides nested sets and vector representations of knockout tournaments. The paper introduces classification of probability domain assumptions and a new set of axioms. Two new seeding methods are proposed: equal gap seeding and increasing competitive intensity seeding. Under different probability domain assumptions, several axiomatic justifications are obtained for equal gap seeding....

متن کامل

Seeding, Competitive Intensity and Quality in Knock-out Tournaments

University Higher School of Economics (HSE). Any opinions or claims contained in this Working Paper do not necessarily reflect the views of HSE What is the optimal way to seed a knockout tournament in order to maximize the overall spectator interest in it? Seeding affects the set of matches being played in the tournament, while neutral spectators tend to prefer to watch (i) close and intense ma...

متن کامل

On the complexity of schedule control problems for knockout tournaments

Knockout tournaments provide a common and important framework for structuring sporting competitions, worth billions of dollars every year in the global economy. Knockout tournaments also model a specific type of election scheme: namely, sequential pairwise elimination elections. The designer of a tournament typically controls both the shape of the tournament (usually a binary tree) and the seed...

متن کامل

Robust Draws in Balanced Knockout Tournaments

Balanced knockout tournaments are ubiquitous in sports competitions and are also used in decisionmaking and elections. The traditional computational question, that asks to compute a draw (optimal draw) that maximizes the winning probability for a distinguished player, has received a lot of attention. Previous works consider the problem where the pairwise winning probabilities are known precisel...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010